Synthesis of (Choice-Free) Reset Nets

Instead of synthesising a labelled transition system into weighted Petri net, we shall here consider the larger class nets with reset arcs, allowing to instanciate systems. We also target an extension choice-free since appeared be especially interesting in terms properties, synthesis and implementation. In addition general algorithm, analyse how speed it up by reducing number complexity linear systems constraints solved set pre-synthesis phase. envisage implement result such as concurrent program.